Superdeduction in Lambda-Bar-Mu-Mu-Tilde
نویسنده
چکیده
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for superdeduction, both based on Christian Urban’s work on classical sequent calculus. However the computational content of Christian Urban’s calculus is not directly related to the (λ -calculus based) Curry-Howard correspondence. In contrast the λ μμ̃-calculus is a λ -calculus for classical sequent calculus. This short paper is a first step towards a further exploration of the computational content of superdeduction proofs, for we extend the λ μμ̃-calculus in order to obtain a proofterm langage together with a cut-elimination reduction for superdeduction. We also prove strong normalisation for this extension of the λ μμ̃-calculus.
منابع مشابه
Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملApproximate solutions of homomorphisms and derivations of the generalized Cauchy-Jensen functional equation in $C^*$-ternary algebras
In this paper, we prove Hyers-Ulam-Rassias stability of $C^*$-ternary algebra homomorphism for the following generalized Cauchy-Jensen equation $$eta mu fleft(frac{x+y}{eta}+zright) = f(mu x) + f(mu y) +eta f(mu z)$$ for all $mu in mathbb{S}:= { lambda in mathbb{C} : |lambda | =1}$ and for any fixed positive integer $eta geq 2$ on $C^*$-ternary algebras by using fixed poind alternat...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملDenotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کامل